21![Scalable Continuous Range Monitoring of Moving Objects in Symbolic Indoor Space Bin Yang1,2 Hua Lu1 Christian S. Jensen1 1 Scalable Continuous Range Monitoring of Moving Objects in Symbolic Indoor Space Bin Yang1,2 Hua Lu1 Christian S. Jensen1 1](https://www.pdfsearch.io/img/a1bbbea5296bed6557250d066b4b3ba0.jpg) | Add to Reading ListSource URL: people.cs.aau.dkLanguage: English - Date: 2009-08-03 07:39:51
|
---|
22![RMM Vol. 3, 2012, 66–70 http://www.rmm-journal.de/ Book Review Michael Laver and Ernest Sergenti: RMM Vol. 3, 2012, 66–70 http://www.rmm-journal.de/ Book Review Michael Laver and Ernest Sergenti:](https://www.pdfsearch.io/img/f1762427597ec0d3bdbae9c494e7049a.jpg) | Add to Reading ListSource URL: www.rmm-journal.comLanguage: English - Date: 2012-08-15 07:31:55
|
---|
23![Building and Comparing Qualitative Descriptions of Three-Dimensional Design Sketches Andrew Lovett Morteza Dehghani Kenneth Forbus {andrew-lovett@, morteza@cs., forbus@}northwestern.edu Building and Comparing Qualitative Descriptions of Three-Dimensional Design Sketches Andrew Lovett Morteza Dehghani Kenneth Forbus {andrew-lovett@, morteza@cs., forbus@}northwestern.edu](https://www.pdfsearch.io/img/15b7345cdbf7bb4acd57173a21bd0d65.jpg) | Add to Reading ListSource URL: silccenter.orgLanguage: English - Date: 2010-05-05 11:56:20
|
---|
24![Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair](https://www.pdfsearch.io/img/dbd8b6f587eb2d2f26490518cad8d1d2.jpg) | Add to Reading ListSource URL: bioinfo.ict.ac.cnLanguage: English - Date: 2014-11-28 11:05:21
|
---|
25![On Skolemization in constructive theories Matthias Baaz∗ Rosalie Iemhoff Inst. for Discrete Math. and Geometry E104 On Skolemization in constructive theories Matthias Baaz∗ Rosalie Iemhoff Inst. for Discrete Math. and Geometry E104](https://www.pdfsearch.io/img/bf79a10bd26beebf8d82b4a2e856b7b9.jpg) | Add to Reading ListSource URL: www.phil.uu.nlLanguage: English - Date: 2008-02-06 05:45:02
|
---|
26![Chi-Han Peng & Peter Wonka / Connectivity Editing for Quad-Dominant Meshes Additional Materials Figure 17: The two possible outcomes (depending on the pvertex/d-vertex labeling) in the primal domain √ by applying a Chi-Han Peng & Peter Wonka / Connectivity Editing for Quad-Dominant Meshes Additional Materials Figure 17: The two possible outcomes (depending on the pvertex/d-vertex labeling) in the primal domain √ by applying a](https://www.pdfsearch.io/img/2f955028cdbff19893fee416176c0f59.jpg) | Add to Reading ListSource URL: peterwonka.netLanguage: English - Date: 2013-06-17 17:23:15
|
---|
27![Illinois Geometry Lab Apollonian Circle Packing Density Author: Joseph Vandehey Illinois Geometry Lab Apollonian Circle Packing Density Author: Joseph Vandehey](https://www.pdfsearch.io/img/95492ff116704a084cf2b933b42432a6.jpg) | Add to Reading ListSource URL: www.math.illinois.eduLanguage: English - Date: 2012-12-09 10:36:33
|
---|
28![SpaceTwist: Managing the Trade-Offs Among Location Privacy, Query Performance, and Query Accuracy in Mobile Services Man Lung Yiu, Christian S. Jensen, Xuegang Huang, Hua Lu Department of Computer Science Aalborg Univers SpaceTwist: Managing the Trade-Offs Among Location Privacy, Query Performance, and Query Accuracy in Mobile Services Man Lung Yiu, Christian S. Jensen, Xuegang Huang, Hua Lu Department of Computer Science Aalborg Univers](https://www.pdfsearch.io/img/94479f4265e052b7e7616ac3bfb51ce2.jpg) | Add to Reading ListSource URL: people.cs.aau.dkLanguage: English - Date: 2007-11-19 06:24:47
|
---|
29![The Number of Edges of Many Faces in a Line Segment Arrangement1 B. Aronov2 , H. Edelsbrunner3 , L. J. Guibas4 , and M. Sharir5 Abstract We show that the maximum number of edges bounding m faces in an arrangement of The Number of Edges of Many Faces in a Line Segment Arrangement1 B. Aronov2 , H. Edelsbrunner3 , L. J. Guibas4 , and M. Sharir5 Abstract We show that the maximum number of edges bounding m faces in an arrangement of](https://www.pdfsearch.io/img/56f282b1482a6f23e9813aaadd739bc3.jpg) | Add to Reading ListSource URL: www.math.tau.ac.ilLanguage: English - Date: 2012-06-29 10:26:38
|
---|